Largest digraphs contained in alln-tournaments
نویسندگان
چکیده
منابع مشابه
Largest digraphs contained in all n-tournaments
A directed graph G is an unavoidable subgraph o f all n-tournaments or, simply n-unavoidable, if every tournament on n vertices contain san isomorphic copy o f G, i.e., for each ntournament T there exists an edge preserving injection o f the vertices o f G into the vertices o f T. The problem o f showing certain types o f graphs to be n-unavoidable has been the subject o f several papers, for e...
متن کاملEccentric Digraphs of Tournaments
Let G=(V,A) be a digraph. The eccentricity e(u) of a vertex u is the maximum distance from u to any other vertex in G. A vertex v in G is an eccentric vertex of u if the distance from u to v equals e(u). The eccentric digraph ED(G) of a digraph G has the same vertex set as G and has arcs from a vertex v to its eccentric vertices. In this paper we present several results on the eccentric digraph...
متن کاملSpanning Local Tournaments in Locally Semicomplete Digraphs
We investigate the existence of a spanning local tournament with possibly high connectivity in a highly connected locally semicomplete digraph. It is shown that every (3k 2)-connected locally semicomplete digraph contains a k-connected spanning local tournament. This improves the result of Bang-Jensen and Thomassen for semicomplete digraphs and of Bang-Jensen [I] for locally semicomplete digrap...
متن کاملDomination Graphs of Tournaments and Digraphs
The domination graph of a digraph has the same vertices as the digraph with an edge between two vertices if every other vertex loses to at least one of the two. Previously, the authors showed that the domination graph of a tournament is either an odd cycle with or without isolated and/or pendant vertices, or a forest of caterpillars. They also showed that any graph consisting of an odd cycle wi...
متن کاملDichromatic number, circulant tournaments and Zykov sums of digraphs
The dichromatic number dc(D) of a digraph D is the smallest number of colours needed to colour the vertices of D so that no monochromatic directed cycle is created. In this paper the problem of computing the dichromatic number of a Zykov-sum of digraphs over a digraph D is reduced to that of computing a multicovering number of an hypergraph H1(D) associated to D in a natural way. This result al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 1983
ISSN: 0209-9683,1439-6912
DOI: 10.1007/bf02579345